L0 sparse graphical modeling
نویسندگان
چکیده
Graphical models are well established in providing compact conditional probability descriptions of complex multivariable interactions. In the Gaussian case, graphical models are determined by zeros in the precision or concentration matrix, i.e. the inverse of the covariance matrix. Hence, there has been much recent interest in sparse precision matrices in areas such as statistics, machine learning, computer vision, pattern recognition and signal processing. In this paper we propose a simple new algorithm for constructing a sparse estimator for the precision matrix from multivariate data where the sparsity is enforced by an l0 penalty. We compare and test the quality of our method on a synthetic graphical model.
منابع مشابه
Learning Sparse Gaussian Graphical Model with l0-regularization
For the problem of learning sparse Gaussian graphical models, it is desirable to obtain both sparse structures as well as good parameter estimates. Classical techniques, such as optimizing the l1-regularized maximum likelihood or Chow-Liu algorithm, either focus on parameter estimation or constrain to specific structure. This paper proposes an alternative that is based on l0-regularized maximum...
متن کاملL0-Regularized Object Representation for Visual Tracking
Introduction & Motivation: Visual tracking is a highly researched topic in the computer vision community since it has been widely applied in visual surveillance, driver assistant system, and many others. Although much progress has been made in the past decades, designing a practical visual tracking system is still a challenging problem due to numerous challenges in real world. Very recent effor...
متن کاملSparsity-Aware and Noise-Robust Subband Adaptive Filter
This paper presents a subband adaptive filter (SAF) for a system identification where an impulse response is sparse and disturbed with an impulsive noise. Benefiting from the uses of l1-norm optimization and l0-norm penalty of the weight vector in the cost function, the proposed l0-norm sign SAF (l0-SSAF) achieves both robustness against impulsive noise and much improved convergence behavior th...
متن کاملA Hybrid L0-L1 Minimization Algorithm for Compressed Sensing MRI
INTRODUCTION Both L1 minimization [1] and homotopic L0 minimization [2] techniques have shown success in compressed-sensing MRI reconstruction using reduced k-space data. L1 minimization algorithm is known to usually shrink the magnitude of reconstructions especially for larger coefficients [1, 3] and non-convex penalty used in homotopic L0 minimization is advocated to replace L1 penalty [3]. H...
متن کاملLearning Directed Acyclic Graphs with Penalized Neighbourhood Regression
We consider the problem of estimating a directed acyclic graph (DAG) for a multivariate normal distribution from high-dimensional data with p ≫ n. Our main results establish nonasymptotic deviation bounds on the estimation error, sparsity bounds, and model selection consistency for a penalized least squares estimator under concave regularization. The proofs rely on interpreting the graphical mo...
متن کامل